A new n-ary existential quantifier in description logics

The Need for an n-ary Existential Quantifier in Description Logics

Motivated by the development of an information system based on Description Logics (DL), which provides efficient support for searching mathematical models in chemical process engineering, an n-ary existential quantifier for Description Logics is proposed. We show that the quantifier can be paraphrased using concept conjunctions and disjunctions and qualified number restrictions. Due to its high...

Polynomial Combined Rewritings for Linear Existential Rules and DL-Lite with n-ary Relations

Rank Hierarchies for Generalized Quantifiers

We show that for each n and m, there is an existential first order sentence which is NOT logically equivalent to a sentence of quantifier rank at most m in infinitary logic augmented with all generalized quantifiers of arity at most n. We use this to show the strictness of the quantifier rank hierarchies for various logics ranging from existential (or universal) fragments of first order logic t...

NEW TYPES OF FUZZY n-ARY SUBHYPERGROUPS OF AN n-ARY HYPERGROUP

In this paper, the new notions of ``belongingness ($in_{gamma}$)"and ``quasi-coincidence ($q_delta$)"  of a fuzzy point with a fuzzyset are  introduced. By means of this new idea, the  concept of$(alpha,beta)$-fuzzy $n$-ary subhypergroup of an $n$-aryhypergroup is given, where $alpha,betain{in_{gamma}, q_{delta},in_{gamma}wedge q_{delta}, ivq}$,  andit is shown that, in 16 kinds of $(alpha,beta...

Conjunctive Query Containment in Description Logics with n-ary Relations

Recent research points out that query containment is a central problem in several database and knowledge base applications, including data warehousing, data integration, query optimization, and (materialized) view maintenance. In this paper we present a decision procedure for containment of conjunctive queries de ned over a database schema speci ed in a very expressive description logic, compri...